Stopping rule reversal for finite Markov chains

نویسنده

  • Andrew Beveridge
چکیده

Consider a finite irreducible Markov chain with transition matrix M = (pij). Fixing a target distribution τ , we study a family of optimal stopping rules from the singleton distributions to τ . We show that this family of rules is dual to a family of (not necessarily optimal) rules on the reverse chain from the singleton distributions to a related distribution α̂ called the τ -contrast distribution. This duality can be expressed using matrices of exit frequencies. Furthermore, we identify a third distribution β called the τ -core such that α̂ and β are entirely dual to one another: a family of optimal rules to α̂ on the reverse chain are dual to a family of optimal rules to β on the forward chain. Using this duality, we provide new proofs of some exact mixing measure results of Lovász and Winkler [11] concerning the mixing time, the reset time and the forget time. In addition, we show that the time between independent samples of α̂ on the reverse chain is equal to the time between independent samples of β on the forward chain. Finally, we study the properties of matrices of exit frequencies for optimal families of stopping rules. We show that the inverse of an exit frequency matrix can be obtained via an alteration of the singular matrix I − M . Our observations lead to new proofs of two spectral results for mixing measures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compressing Redundant Information in Markov Chains

Given a strongly stationary Markov chain and a finite set of stopping rules, we prove the existence of a polynomial algorithm which projects the Markov chain onto a minimal Markov chain without redundant information. Markov complexity is hence defined and tested on some classical problems.

متن کامل

Compressing Oversized Information in Markov Chains

Given a strongly stationary Markov chain and a finite set of stopping rules, we prove the existence of a polynomial algorithm which projects the Markov chain onto a minimal Markov chain without redundant information. Markov complexity is hence defined and tested on some classical problems.

متن کامل

Reversal of Markov Chains and the Forget Time

We study three quantities that can each be viewed as the time needed for a finite irreducible Markov chain to “forget” where it started. One of these is the mixing time, the minimum mean length of a stopping rule that yields the stationary distribution from the worst starting state. A second is the forget time, the minimum mean length of any stopping rule that yields the same distribution from ...

متن کامل

Empirical Bayes Estimation in Nonstationary Markov chains

Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical  Bayes estimators  for the transition probability  matrix of a finite nonstationary  Markov chain. The data are assumed to be of  a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...

متن کامل

Mixing Times for Uniformly Ergodic Markov Chains

Consider the class of discrete time, general state space Markov chains which satist)' a "'uniform ergodicity under sampling" condition. There are many ways to quantify the notion of "mixing time", i.e., time to approach stationarity from a worst initial state. We prove results asserting equivalence (up to universal constants) of different quantifications of mixing time. This work combines three...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006